ar X iv : c s . C G / 0 70 30 37 v 1 8 M ar 2 00 7 Constructing Optimal Highways ∗
نویسندگان
چکیده
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed v, we consider the problem of finding a highway that minimizes the maximum travel time over all pairs of points in S. If the orientation of the highway is fixed, the optimal highway can be computed in linear time, both for the L1and the Euclidean metric as the underlying metric. If arbitrary orientations are allowed, then the optimal highway can be computed in O(n log n) time. We also consider the problem of computing an optimal pair of highways, one being horizontal, one vertical.
منابع مشابه
ar X iv : 0 70 7 . 40 46 v 1 [ m at h . A G ] 2 7 Ju l 2 00 7 CLIFFORD ’ S THEOREM FOR COHERENT SYSTEMS
Let C be an algebraic curve of genus g ≥ 2. We prove an analogue of Clifford’s theorem for coherent systems on C and some refinements using results of Re and Mercat.
متن کاملar X iv : c s . C G / 0 70 30 23 v 1 6 M ar 2 00 7 Computing a Minimum - Dilation Spanning Tree is NP - hard ∗
In a geometric network G = (S,E), the graph distance between two vertices u, v ∈ S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices differs from their Euclidean distance. We show that given a set S of n points with integer coordinates in the plane and a rational dilation δ > 1, it is NP-hard to d...
متن کاملar X iv : 0 70 8 . 37 30 v 1 [ m at h . PR ] 2 8 A ug 2 00 7 DENSITIES FOR ROUGH DIFFERENTIAL EQUATIONS UNDER HÖRMANDER ’ S CONDITION
We consider stochastic differential equations dY = V (Y ) dX driven by a multidimensional Gaussian process X in the rough path sense. Using Malliavin Calculus we show that Yt admits a density for t ∈ (0, T ] provided (i) the vector fields V = (V1, ..., Vd) satisfy Hörmander’s condition and (ii) the Gaussian driving signal X satisfies certain conditions. Examples of driving signals include fract...
متن کاملPhysical and Spectral Characteristics of the T 8 and Later - Type Dwarfs
ar X iv :0 70 5. 26 02 v1 [ as tr oph ] 1 7 M ay 2 00 7
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007